A minimax procedure for electing committees

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Minimax Procedure for Electing Committees

A new voting procedure for electing committees, called the minimax procedure, is described. Based on approval voting (AV), it chooses the committee that minimizes the maximum “Hamming distance” to all voters (minimax outcome). Such an outcome may be diametrically opposed to the outcome obtained from aggregating votes in the usual manner, which minimizes the sum of the Hamming distances to all v...

متن کامل

Proposal : Electing Committees Stephen C

Extensive work has been done to expose and analyze the flaws in common single-candidate election procedures. Arrow’s Theorem states that there exists no perfect voting procedure, so the existing research serves to compare and analyze existing voting systems as well as propose new systems. The problem of electing committees is clearly more complex; less research has been done to investigate the ...

متن کامل

Electing Committees by Approval Balloting

We study committee election models where voters' approvals over candidates are collected and the election outcome is determined according to a predetermined voting rule, in particular issue-wise majority rule. The properties of these models are investigated with a special attention to representativeness of the election outcomes, where representativeness relates to the way they are consistent wi...

متن کامل

Electing a parliament

We present a model where a society elects candidates belonging to two parties to a national parliament. The electoral rule determines the seats distribution between the two parties. We analyze two electoral rules, multidistrict majority and single-district proportional. The policy outcome is a function of the number of seats the two parties win in the election. We prove that under both systems ...

متن کامل

Electing a Leader

The following scenario was examined in [1]: we toss  ideal coins, then toss those which show tails after the first toss, then toss those which show tails after the second toss, etc. Observe that if, at a given toss, only heads appear, then the process immediately terminates. Suppose instead that we require the coins (all of which showed heads) to be tossed again? Under such a change of rules, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Public Choice

سال: 2007

ISSN: 0048-5829,1573-7101

DOI: 10.1007/s11127-007-9165-x